Implementing Data Cubes Eciently

Decision support applications involve complex queries on very large databases Since response times should be small query optimization is critical Users typically view the data as multi dimensional data cubes Each cell of the data cube is a view consisting of an aggregation of interest like total sales The values of many of these cells are dependent on the values of other cells in the data cube A common and powerful query optimization technique is to materialize some or all of these cells rather than compute them from raw data each time Commercial systems di er mainly in their approach to materializing the data cube In this paper we in vestigate the issue of which cells views to materialize when it is too expensive to materialize all views A lattice framework is used to express dependencies among views We then present greedy algorithms that work o this lattice and determine a good set of views to materialize The greedy algorithm performs within a small constant factor of optimal under a variety of models We then consider the most common case of the hypercube lattice and examine the choice of materialized views for hypercubes in detail giving some good tradeo s between the space used and the average time to answer a query